Binding-time Analysis: Abstract Interpretation versus Type Inference
نویسندگان
چکیده
Interpretation versus Type Inference Jens Palsberg Michael I. Schwartzbach [email protected] [email protected] Computer Science Department, Aarhus University Ny Munkegade, DK–8000 Aarhus C, Denmark
منابع مشابه
Binding - time Analysis :
Binding-time analysis is important in partial eval-uators. Its task is to determine which parts of a program can be evaluated if some of the expected input is known. Two approaches to do this are abstract interpretation and type inference. We compare two speciic such analyses to see which one determines most program parts to be eliminable. The rst is a an abstract interpretation approach based ...
متن کاملProgram analysis and specialisation using tree automata
Static analysis of programs using regular tree grammars has been studied for more than 30 years, the earliest example being Reynolds’ work on automatic derivation of data-type definitions from untyped functional programs. Recently the topic has attracted renewed attention, with applications in program specialisation, data flow analysis, shape analysis, mode and type inference, termination analy...
متن کاملEecient Type Inference for Higher-order Binding-time Analysis
Binding-time analysis determines when variables and expressions in a program can be bound to their values, distinguishing between early (compile-time) and late (run-time) binding. Binding-time information can be used by compilers to produce more eecient target programs by partially evaluating programs at compile-time. Binding-time analysis has been formulated in abstract interpretation contexts...
متن کاملType Inference, Abstract Interpretation and Strictness Analysis
Coppo, M. and A. Ferrari, Type inference, abstract interpretation and strictness analysis, Theoretical Computer Science 121 (1993) 113-143. Filter domains (Coppo et al., 1984) can be seen as abstract domains for the interpretation of (functional) type-free programming languages. What is remarkable is the fact that in filter domains the interpretation of a term is given by the set of its types i...
متن کاملEfficient Type Inference for Higher-Order Binding-Time Analysis
Binding-time analysis determines when variables and expressions in a program can be bound to their values, distinguishing between early (compile-time) and late (run-time) binding. Binding-time information can be used by compilers to produce more efficient target programs by partially evaluating programs at compile-time. Binding-time analysis has been formulated in abstract interpretation contex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994